Degree divisibility in character correspondences

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Six Degree of Freedom Point Correspondences

In this paper we develop the best homogeneous matrix transformation to fit two streams of dynamic six degree of freedom (6DOF) data. In particular, we compare object position and orientation results from two 6DOF sources. A problem that arises when comparing these two data streams is that they are not necessarily in the same coordinate system. Therefore, a method to transform one coordinate sys...

متن کامل

Perfect divisibility and 2-divisibility

A graph G is said to be 2-divisible if for all (nonempty) induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that ω(A) < ω(H) and ω(B) < ω(H). A graph G is said to be perfectly divisible if for all induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that H[A] is perfect and ω(B) < ω(H). We prove that if a graph is (P5, C5)-free, then it is 2-divisibl...

متن کامل

Groups with a Character of Large Degree

Let G be a finite group of order n and V a simple C[G]-module of dimension d. For some nonnegative number e, we have n = d(d + e). If e is small, then the character of V has unusually large degree. We fix e and attempt to classify such groups. For e ≤ 3 we give a complete classification. For any other fixed e we show that there are only finitely many examples.

متن کامل

Character Degree Graphs That Are Complete Graphs

Let G be a finite group, and write cd(G) for the set of degrees of irreducible characters of G. We define Γ(G) to be the graph whose vertex set is cd(G) − {1}, and there is an edge between a and b if (a, b) > 1. We prove that if Γ(G) is a complete graph, then G is a solvable group.

متن کامل

Primes in Divisibility Sequences

We give an overview of two important families of divisibility sequences: the Lehmer–Pierce family (which generalise the Mersenne sequence) and the elliptic divisibility sequences. Recent computational work is described, as well as some of the mathematics behind these sequences.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2007

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2006.06.010